GA Based Scheduling Model for Computational Grid to Minimize Turnaround Time
نویسندگان
چکیده
Scheduling on distributed systems is an NP hard problem and grid being a wide heterogeneous expandable system makes scheduling even a tougher job. Genetic algorithm, based on natural selection and evolution has gained popularity in recent times because of its effectiveness in handling optimization problems. In this article, a job-scheduling model for a computational grid with the objective of minimizing the turnaround time using genetic algorithm is proposed. The model evaluates various clusters in the grid to find the most suitable one with minimum turnaround time for the job-scheduling. Simulation studies compare the performance of this model with other similar models. DOI: 10.4018/jghpc.2009070806 IGI PUBLISHING This paper appears in the publication, International Journal of Grid and High Performance Computing,Volume 1, Issue 4 edited by Emmanuel Udoh and Frank Zhigang Wang © 2009, IGI Global 701 E. Chocolate Avenue, Hershey PA 17033-1240, USA Tel: 717/533-8845; Fax 717/533-8661; URL-http://www.igi-global.com ITJ 5401
منابع مشابه
A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملFlow Shop Scheduling Problem with Missing Operations: Genetic Algorithm and Tabu Search
Flow shop scheduling problem with missing operations is studied in this paper. Missing operations assumption refers to the fact that at least one job does not visit one machine in the production process. A mixed-binary integer programming model has been presented for this problem to minimize the makespan. The genetic algorithm (GA) and tabu search (TS) are used to deal with the optimization...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملTwo-stage fuzzy-stochastic programming for parallel machine scheduling problem with machine deterioration and operator learning effect
This paper deals with the determination of machine numbers and production schedules in manufacturing environments. In this line, a two-stage fuzzy stochastic programming model is discussed with fuzzy processing times where both deterioration and learning effects are evaluated simultaneously. The first stage focuses on the type and number of machines in order to minimize the total costs associat...
متن کاملStability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid
Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJGHPC
دوره 1 شماره
صفحات -
تاریخ انتشار 2009